Generalized lattice-point visibility in ?k
نویسندگان
چکیده
It is a well-known result that the proportion of lattice points visible from origin given by $\frac{1}{\zeta(2)}$, where $\zeta(s)=\sum_{n=1}^\infty\frac{1}{n^s}$ denotes Riemann zeta function. Goins, Harris, Kubik and Mbirika, generalized notion point visibility saying for fixed $b\in\mathbb{N}$, $(r,s)\in\mathbb{N}^2$ $b$-visible if no other lies on graph function $f(x)=mx^b$, some $m\in\mathbb{Q}$, between $(r,s)$. In their analysis they establish $\frac{1}{\zeta(b+1)}$, which generalizes in classical setting. this short note we give an $n$-dimensional $\bf{b}$-visibility recovers one presented Goins et. al. $2$-dimensions, $n$-dimensions. We prove ${\bf{b}}=(b_1,b_2,\ldots,b_n)\in\mathbb{N}^n$ ${\bf{b}}$-visible $\frac{1}{\zeta(\sum_{i=1}^nb_i)}$. Moreover, propose vectors $\bf{b}\in \mathbb{Q}_{>0}^n$, show imposing weak conditions those obtains density ${\bf{b}}=(\frac{b_1}{a_1},\frac{b_2}{a_2},\ldots,\frac{b_n}{a_n})\in\mathbb{Q}_{>0}^n$-visible Finally, (\mathbb{Q}^{*})^n$, compatible with previous notion, results Harris Omar $b\in \mathbb{Q}^{*}$ $2$-dimensions; $\bf{b}$-visible case only depends negative entries $\bf{b}$.
منابع مشابه
Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملConservative From-Point Visibility
Visibility determination has been an important part of the computer graphics research for several decades. First studies of the visibility were hidden line removal algorithms, and later hidden surface removal algorithms. Today’s visibility determination is mainly concentrated on conservative, object level visibility determination techniques. Conservative methods are used to accelerate the rende...
متن کاملBAR k-VISIBILITY GRAPHS
Die selbständige und eigenhändige Anfertigung versichere ich an Eides statt. Conclusion 71 Bibliography 75 Introduction " The true mystery of the world is the visible, not the invisible. " Oscar Wilde How can geometric settings be encoded combinatorially? Which discrete structures extract the essential information from continuous arrangements? How can the combinatorial properties of visibility ...
متن کاملOn k-visibility graphs
We examine several types of visibility graphs in which sightlines can pass through k objects. For k ≥ 1 we bound the maximum thickness of semi-bar k-visibility graphs between d 2 3 (k + 1)e and 2k. In addition we show that the maximum number of edges in arc and circle k-visibility graphs on n vertices is at most (k+1)(3n− k− 2) for n > 4k+4 and ( n 2 ) for n ≤ 4k + 4, while the maximum chromati...
متن کاملBar k-Visibility Graphs
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one correspondence between vertices of G and bars in S, such that there is an edge between two vertices in G if and only if there exists an unobstructed vertical line of sight between their corresponding bars. If bars are a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Involve
سال: 2021
ISSN: ['1944-4184', '1944-4176']
DOI: https://doi.org/10.2140/involve.2021.14.103